Pii: S0167-8396(02)00127-9

نویسندگان

  • R. Ait-Haddou
  • L. Biard
  • M. A. Slawinski
چکیده

In this paper, we show that there exists a close dependence between the control polygon of a polynomial and the minimum of its blossom under symmetric linear constraints. We consider a given minimization problem P , for which a unique solution will be a point δ on the Bézier curve. For the minimization function f , two sufficient conditions exist that ensure the uniqueness of the solution, namely, the concavity of the control polygon of the polynomial and the characteristics of the Polya frequency-control polygon where the minimum coincides with a critical point of the polynomial. The use of the blossoming theory provides us with a useful geometrical interpretation of the minimization problem. In addition, this minimization approach leads us to a new method of discovering inequalities about the elementary symmetric polynomials.  2002 Published by Elsevier Science B.V.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pii: S0167-8396(02)00164-4

We study the relationship of transformations between Legendre and Bernstein basis. Using the relationship, we present a simple and efficient method for optimal multiple degree reductions of Bézier curves with respect to the L2-norm.  2002 Elsevier Science B.V. All rights reserved.

متن کامل

Pii: S0167-8396(02)00090-0

This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial parametrization and by the absence of affine singularities. The algorithm requires O(n3 logn) field operations, where n is the degree of the curve.  2002 Elsevier Science B.V. All rights reserved.

متن کامل

Refinement operators for triangle meshes

Refinement operators for triangular meshes as used in subdivision schemes or remeshing are discussed. A numbering scheme is presented, covering all refinement operators that (topologically) map vertices onto vertices. Using this characterization, some special properties of n-adic and √ 3-subdivision are easy to see.

متن کامل

Kernel density estimation with adaptive varying window size

A new method of kernel density estimation with a varying adaptive window size is proposed. It is based on the socalled intersection of confidence intervals (ICI) rule. Several examples of the proposed method are given for different types of densities and the quality of the adaptive density estimate is assessed by means of numerical simulations. 2002 Elsevier Science B.V. All rights reserved.

متن کامل

Component-based workflow systems development

Component-based development is a promising way to promote the productivity of large workflow systems development. This paper proposes a component-based workflow systems development approach by investigating the following notions, mechanisms, and methods: workflow component, workflow component composition, reuse–association relationship between workflow components, and workflow component reposit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002